Ubiquitous monotone and almost-monotone Boolean functions in systems biology
نویسنده
چکیده
Systems Biology is quickly becoming a major focus of applied and computational mathematics research. While traditionally numerics and continuous modeling techniques have been used, in recent years it has become apparent that qualitative modeling, data quantization and data mining questions play a central role for the field. Monotone Boolean functions are ubiquitous in these models, and, surprisingly, often both the function and its dual simultaneously convey practically useful information: Consider the hypergraph defined by the metabolites interacting in a metabolic network, expressed as the stoichiometric matrix. Then the socalled elementary modes are nothing but the extreme rays of the rational polyhedral cone given by the matrix, and their support patterns form a hypergraph. Every transversal of this hypergraph is a so called cut set, and the set of all (minimal) cut sets is of central interest when analyzing failure modes of the system under consideration (Haus, Klamt, & Stephen 2008). Many other biological phenomena can also be modeled using hypergraphs, or would profit from the combinatorial richness that simple graph approximations cannot provide (Klamt, Haus, & Theis 2009). Monotone functions also arise from non-hypergraph models: In the context of ancestral genome reconstruction one question is whether a matrix whose columns are genomic markers and whose rows list, for various species, which genomic markers are present. The hypothesis is that in a hypothetical ancestor these markers were consecutive. Therefore one is interested in deciding whether the columns of the matrix can be reordered to make nonzero entries in all rows consecutive. This property, known as consecutive-ones-property (C1P) can be checked in polynomial time(Fulkerson & Gross 1965; Tucker 1972), and is (up-)monotone under taking submatrices. If the matrix fails to be C1P, one needs to find out which rows are the cause: The minimal conflicting sets of rows are determined by the dual monotone function (Chauve et al. 2009). Finally, some applications give rise to boolean func-
منابع مشابه
Almost all monotone Boolean functions are polynomially learnable using membership queries
We consider exact learning or identification of monotone Boolean functions by only using membership queries. It is shown that almost all monotone Boolean functions are polynomially identifiable in the input number of variables as well as the output being the sum of the sizes of the CNF and DNF representations. 2001 Elsevier Science B.V. All rights reserved.
متن کاملOn the number of bipolar Boolean functions
A Boolean function is bipolar iff it is monotone or antimonotone in each of its arguments. We investigate the number b(n) of n-ary bipolar Boolean functions. We present an (almost) closed-form expression for b(n) that uses the number a(n) of antichain covers of an n-element set. This is closely related to Dedekind’s problem, which can be rephrased as determining the number d(n) of Boolean funct...
متن کاملDynamical systems analysis of stack filters
We study classes of dynamical systems that can be obtained by constructing recursive networks with monotone Boolean functions. Stack filters in nonlinear signal processing are special cases of such systems. We show an analytical connection between coefficients used to optimize the statistical properties of stack filters and their sensitivity, a measure that can be used to characterize the dynam...
متن کاملGENERALIZED POSITIVE DEFINITE FUNCTIONS AND COMPLETELY MONOTONE FUNCTIONS ON FOUNDATION SEMIGROUPS
A general notion of completely monotone functionals on an ordered Banach algebra B into a proper H*-algebra A with an integral representation for such functionals is given. As an application of this result we have obtained a characterization for the generalized completely continuous monotone functions on weighted foundation semigroups. A generalized version of Bochner’s theorem on foundation se...
متن کاملProbabilistic Construction of Monotone Formulae for Positive Linear Threshold Functions
We extend Valiant's construction of monotone formulae for the majority function to obtain an eecient probabilistic construction of small monotone formulae for arbitrary positive linear threshold functions. We show that any positive linear threshold function on n boolean variables which has weight complexity q(n) can be computed by a monotone boolean formula of size O(q(n) 3:3 n 2): Our techniqu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010